Solving the Car-Sequencing Problem as a Non-binary CSP
نویسندگان
چکیده
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solution time for this problem, different ordering heuristics were implementented. The results obtained by using these methods are compared on the instances reported in the CSPLib.
منابع مشابه
Mathematical Model and Algorithm for sequencing operations in the machine building industry
In this paper, the problem of sequencing machines in the final assembly line with regard to the supply of parts has been investigated. For this reason, a basic integer linear programming model has been developed and based on this, the problem-solving algorithm is developed in accordance with the reaction-based approach based on the renewal of the sequence of operations. Also, due to the Np-hard...
متن کاملImplementation and Applications of Non-Binary Ad Hoc Constraints
Many real-life combinatorial problems such as scheduling and planning can be modeled as a constraint satisfaction problem (CSP). Informally speaking, a CSP comprises a set of constraints over a set of variables, where each variable can only take values from its domain which is, without loss of generality, a set of non-negative integers. Solving a CSP requires finding a value for each variable f...
متن کاملBinary CSP Solving as an Inference Process
We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving Binary CSP once they are expressed as rewriting rules coordinated by strategies.
متن کاملSolving Path Following Problem for Car-Like Robot in the Presence of Sliding Effect via LMI Formulation
One of the main problems of car-like robot is robust path following in the presence of sliding effect. To tackle this problem, a robust mix H2/H∞ static state feedback control method is selected. This method is the well-known linear robust controller which is robust against external disturbance as well as model uncertainty. In this paper, the path following problem is formulated as linear matri...
متن کاملA Beam Search approach for the optimization version of the Car Sequencing Problem
The Car Sequencing Problem (CSP) is a feasibility problem that has attracted the attention of the Constraint Programming community for a number of years now. In this paper, a new version (opt-CSP) that extends the original problem is defined, converting this into an optimization problem in which the goal is to satisfy the typical hard constraints. This paper presents a solution procedure for op...
متن کامل